Proactive Message Passing on Memory Factor Networks
نویسندگان
چکیده
We introduce a new type of graphical model that we call a “memory factor network” (MFN). We show how to use MFNs to model the structure inherent in many types of data sets. We also introduce an associated message-passing style algorithm called “proactive message passing” (PMP) that performs inference on MFNs. PMP comes with convergence guarantees and is efficient in comparison to competing algorithms such as variants of belief propagation. We specialize MFNs and PMP to a number of distinct types of data (discrete, continuous, labelled) and inference problems (interpolation, hypothesis testing), provide examples, and discuss approaches for efficient implementation.
منابع مشابه
Parallel Distributed Application Performance and Message Passing: A case study
This paper discusses experimental results concerning the design of message passing system software for shared memory and distributed memory multiprocessors as well as networks of workstations. It compares the performance of example applications and simple benchmarks running on the same operating system and message passing system on a shared memory Encore Multimax multiprocessor, on the distribu...
متن کاملLow Latency Message-Passing for Reflective Memory Networks
In this paper we present an eecient design for message passing over a reeective memory network. First, we consider the attributes of reeec-tive memory communication networks and the requirements to eeciently build message-passing functional-ity on these networks. We then introduce the Bill-Board Protocol, a lock-free protocol which provides low-latency send, receive, and multicast functionality...
متن کاملHPARC: A Mixed Shared Memory and Message Passing Programming Style for Heterogeneous Local Area Networks
We consider the problem of parallel programming in heterogeneous local area networks which connect segments of workstations and parallel machines (either message-passing or shared memory) using a variety of communication media. There are two possible ways to transform such a network into a single parallel machine. Implementing a global shared address space using DSM (distributed shared memory) ...
متن کاملParallelizing the Mur' Veriier
With the use of state and memory reduction techniques in veri cation by explicit state enumeration, runtime becomes a major limiting factor. We describe a parallel version of the explicit state enumeration veri er Mur' for distributed memory multiprocessors and networks of workstations that is based on the message passing paradigm. In experiments with three complex cache coherence protocols, pa...
متن کاملSupporting Shared Memory and Message Passing on Clusters of PCs with a SMiLE
With the rise of fast interconnection technologies and new concepts to utilize them without operating system interaction (like VIA 4]), compute clusters are becoming increasingly commonplace. Most of the interconnection networks focus only on message passing as their prime programming model neglecting the large code basis for shared memory. However, by utilizing the Scalable Coherent Interface ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1601.04667 شماره
صفحات -
تاریخ انتشار 2016